//回文数
//https://leetcode.cn/problems/palindrome-number/description/
class Solution {
public:
    bool isPalindrome(int x) {
        string s = to_string(x);
        int left=0,right=s.size()-1;
        while(s[left] == s[right] && left < right) ++left,--right;
        return left >= right;  
    }
};
